Strong Duality in Horn Minimization
نویسندگان
چکیده
منابع مشابه
On the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملOn Approximate Horn Minimization
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2 1−ǫ(n)-inapproximability result is proven, which is the first non-trivial inapproximability result for this problem. We also consider several other versions of Horn minimization. The more general version which allows for the introduction of new variable...
متن کاملOptimality certificates for convex minimization and Helly numbers
We consider the problem of minimizing a convex function over a subset of R that is not necessarily convex (minimization of a convex function over the integer points in a polytope is a special case). We define a family of duals for this problem and show that, under some natural conditions, strong duality holds for a dual problem in this family that is more restrictive than previously considered ...
متن کاملStrong Duality: Without Simplex and without theorems of alternatives By
We provide an alternative proof of the strong duality theorem whose main step is a proposition which says that every canonical linear programming minimization problem whose image under its objective function of the set of feasible solutions is non-empty and bounded below has an optimal solution. Unlike earlier proofs, this proof neither uses the simplex method, nor does it use Farkas’s lemma. W...
متن کاملLecture 16: Strong duality
In the last lecture we saw how to formulate a dual program for an optimization problem. From the formulation, it turned out that the dual program gave an upper/lower bound depending on whether the problem was maximization/minimization respectively. Today, the focus will be on when are these bounds tight. It turns out that these bounds are tight in most of the cases of interest like linear progr...
متن کامل